Towards Formal Proof Script Refactoring
نویسندگان
چکیده
We propose proof script refactorings as a robust tool for constructing, restructuring, and maintaining formal proof developments. We argue that a formal approach is vital, and illustrate by defining and proving correct a number of valuable refactorings in a simplified proof script and declarative proof language of our own design.
منابع مشابه
A Framework for Interactive Proof
This paper introduces a software framework for conducting interactive proof, dubbed the Proof General Kit. It defines a component infrastructure, the syntax of messages exchanged between components, and the protocol governing message exchanges. The infrastructure connects provers to one or more display components for interacting with the user, such as the Emacs editor or a plugin for the Eclips...
متن کاملExtended Abstract: Dynamic Proof Pages
Reading a formal proof script written in a procedural (command-driven) style is difficult, bordering on impossible, without access to an interpreter for the script, that generates the states based on the commands. The Proviola system replaces the need for this interpreter, storing responses and displaying them on-demand. This abstract describes a natural extension to the Proviola: instead of wo...
متن کاملTowards Formal Proof Metrics
Recent years have seen increasing success in building large formal proof developments using interactive theorem provers (ITPs). Some proofs have involved many authors, years of effort, and resulted in large, complex interdependent sets of proof “source code” files. Developing these in the first place, and maintaining and extending them afterwards, is a considerable challenge. It has prompted th...
متن کاملRefactoringScript: A Script and Its Processor for Composite Refactoring
Refactoring is widely recognized as a method to improve the internal qualities of source code. However, manual refactoring is time-consuming and error-prone. Consequently, many tools to support automated refactoring have been suggested, but most support only unit and simple refactoring, making it difficult to perform composite refactoring (e.g., introducing a design pattern) where a refactoring...
متن کاملRefactoring Object-Z specifications
This paper describes an approach to transferring techniques of refactorings to formal methods. We use syntactical rewriting rules to express refactorings on Object-Z specifications. In contrast to programming languages here refactorings can be formally proven to preserve the behaviour of the specification. We give an outline of such a proof of behaviour preservation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011